Optimum processors for some sonar detection problems
نویسندگان
چکیده
منابع مشابه
High-speed Processors for Sonar
The Applied Physics Laboratory and its subcontractors have been leaders in the development of programmable sonar signal processors for 19 years. Several novel architectures for both hardware and software have resulted, giving APL the most powerful sonar signal-processing facilities in the United States. This article traces the historical evolution of sonar-processing hardware, with emphasis on ...
متن کاملBayesian Inference and Optimization Strategies for Some Detection and Classification Problems in Sonar Imagery
In this paper, we investigate the use of the Bayesian inference for some detection and classiication problems of great importance in sonar imagery. More precisely this paper is concerned with the segmentation of sonar image, the classiication of object lying on the sea-bottom and the classiication of sea-oor. These aforementioned classiication tasks are based on the identiication of the detecte...
متن کاملglobal results on some nonlinear partial differential equations for direct and inverse problems
در این رساله به بررسی رفتار جواب های رده ای از معادلات دیفرانسیل با مشتقات جزیی در دامنه های کراندار می پردازیم . این معادلات به فرم نیم-خطی و غیر خطی برای مسایل مستقیم و معکوس مورد مطالعه قرار می گیرند . به ویژه، تاثیر شرایط مختلف فیزیکی را در مساله، نظیر وجود موانع و منابع، پراکندگی و چسبندگی در معادلات موج و گرما بررسی می کنیم و به دنبال شرایطی می گردیم که متضمن وجود سراسری یا عدم وجود سراسر...
Approximation Algorithms for Some Optimum Communication Spanning Tree Problems
Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning tree (PROCT) problem is to nd a spanning tree T minimizing ∑ u; v∈ V r(u)r(v)dT (u; v), where dT (u; v) is the length of the path between u and v on T . The optimal sum-requirement communication spanning tree (SROCT) pr...
متن کاملOptimum Buffer Size for Dynamic Voltage Processors
This paper addresses the problem of calculating optimum buffer size for a dynamic voltage scaling processor. We determine the minimum required buffer size giving minimum energy solution for periodic (single, multiple) or aperiodic tasks. The calculations are based on information about data size (maximum, minimum), execution time (best case, worst case), and deadlines.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1974
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700044099